A FAST ALGORITHM FOR CALCULATING S-INVARIANTS

Calculating Invariants as Coreflexive Bisimulations

Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to computer systems engineering. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants’ proof obligation discharge, a fra...

A New Fast Data Encryption Algorithm (FDE)

A Fast DCT Block Smoothing Algorithm S

e o When errors are clearly visible, the blockiness of some artifacts distinguishes them from th riginal image content, suggesting a way of reducing these artifacts. Presumably, the human viewer k e identifies the artifacts by assuming the image does not have 8-pixel by 8-pixel block features. Bloc dge variance, the sum of squared differences between adjacent block edge pixels, is one simple s ...

A New Fast Data Encryption Algorithm (FDE)

A practical algorithm for [r, s, t]-coloring of graph

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...